A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time
نویسندگان
چکیده
Fleischner's theorem says that the square of every 2-connected graph contains a Hamiltonian cycle. We present a proof resulting in an O(|E|) algorithm for producing a Hamiltonian cycle in the square G of a 2connected graph G = (V,E). More generally, we get an O(|E|) algorithm for producing a Hamiltonian path between any two prescribed vertices, and we get an O(|V |) algorithm for producing cycles C3, C4, . . . , C|V | in G of lengths 3, 4, . . . , |V |, respectively.
منابع مشابه
Hamiltonian Paths in the Square of a Tree
We introduce a new family of graphs for which the Hamiltonian path problem is non-trivial and yet has a linear time solution. The square of a graph G = (V, E), denoted as G, is a graph with the set of vertices V , in which two vertices are connected by an edge if there exists a path of length at most 2 connecting them in G. Harary & Schwenk (1971) proved that the square of a tree T contains a H...
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملHamiltonian Cycles in Linear-Convex Supergrid Graphs
A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and triangular grid graphs was known to be NP-complete. In the past, we have shown that the Hamiltonian cycle problem for supergrid graphs is also NP-complete. ...
متن کاملThe Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs
A Hamiltonian cycle (path) of a graph G is a simple cycle (path) which contains all the vertices of G. The Hamiltonian cycle problem asks whether a given graph contains a Hamiltonian cycle. It is NP-complete even for 3-connected planar graphs [3, 61. However, the problem becomes polynomial-time solvable for Cconnected planar graphs: Tutte proved that such a graph necessarily contains a Hamilton...
متن کاملThe circumference of the square of a connected graph
The celebrated result of Fleischner states that the square of every 2-connected graph is Hamiltonian. We investigate what happens if the graph is just connected. For every n ≥ 3, we determine the smallest length c(n) of a longest cycle in the square of a connected graph of order n and show that c(n) is a logarithmic function in n. Furthermore, for every c ≥ 3, we characterize the connected grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018